Backtracking Influence
نویسنده
چکیده
Backtracking influence is influence that zigzags in time. For example, backtracking influence exists when an event E1 makes an event E2 more likely by way of a nomic connection that goes from E1 back in time to an event C and then forward in time to E2. I contend that backtracking influence is redundant in the sense that any existing backtracking influence exerted by E1 on E2 is equivalent to E1’s temporally direct influence on E2. I prove the redundancy of backtracking influence using several plausible physical principles without assuming any fundamental temporal or causal asymmetry. This explanation can play a prominent role in an account of why causation appears to be objectively asymmetric regardless of whether the fundamental laws are temporally
منابع مشابه
Idol-Guided Backtracking Search Optimization Algorithm
This paper introduces a new variant of the Backtracking Search Optimization Algorithm (BSA) in order to improve the quality of the solutions found by the algorithm. The proposed algorithm is called Idol-Guided Backtracking Search Optimization Algorithm (IG-BSA): it uses the historical population defined in BSA to build and update a set of idols taken from several previous generations, and the c...
متن کاملBilateral Teleoperation Systems Using Backtracking Search optimization Algorithm Based Iterative Learning Control
This paper deals with the application of Iterative Learning Control (ILC) to further improve the performance of teleoperation systems based on Smith predictor. The goal is to achieve robust stability and optimal transparency for these systems. The proposed control structure make the slave manipulator follow the master in spite of uncertainties in time delay in communication channel and model pa...
متن کاملSequence-specific thermodynamic properties of nucleic acids influence both transcriptional pausing and backtracking in yeast
RNA Polymerase II pauses and backtracks during transcription, with many consequences for gene expression and cellular physiology. Here, we show that the energy required to melt double-stranded nucleic acids in the transcription bubble predicts pausing in Saccharomyces cerevisiae far more accurately than nucleosome roadblocks do. In addition, the same energy difference also determines when the R...
متن کاملUnrestricted Backtracking Algorithms for Satisfiability
This paper proposes a general framework for implementing backtracking search strategies in Propositional Satisfiability (SAT) algorithms, that is referred to unrestricted backtracking. Different organizations of unrestricted backtracking yield well-known backtracking search strategies. Moreover, this general framework allows devising new backtracking strategies. Hence, we illustrate and compare...
متن کاملGrADSAT: A Parallel SAT Solver for the Grid
We present GrADSAT, a parallel satisfiability solver aimed at solving hard SAT instances using a large number of widely distributed commodity computational resources. The GrADSAT parallel algorithm uses intelligent backtracking, sharing of learned clauses and clause reduction. The distributed implementation allows for dynamic resource acquisition. We show how the large number of computational r...
متن کامل